-
1 sequential redundancy
Большой англо-русский и русско-английский словарь > sequential redundancy
-
2 sequential redundancy
резервирование замещением; состояние ненагруженного резерва* * *Англо-русский словарь нефтегазовой промышленности > sequential redundancy
-
3 sequential redundancy
-
4 sequential redundancy
резервирование замещением; состояние ненагруженного резерваThe English-Russian dictionary on reliability and quality control > sequential redundancy
-
5 redundancy
1. чрезмерность; избыток; избыточность
* * *
1. резервирование; состояние резерва2. избыточность; резерв; избыток
* * *
избыточность; переполнение
* * *
1) резервирование; состояние резерва2) избыточность; резерв; избыток•- active-parallel redundancy
- benign redundancy
- built-in redundancy
- cold redundancy
- combined redundancy
- complete redundancy
- constant redundancy
- dual redundancy
- equal reliability redundancy
- failure redundancy
- fault redundancy
- full redundancy
- functional redundancy
- internal redundancy
- mixed redundancy
- moving redundancy
- selective redundancy
- sequential redundancy
- sequential-parallel redundancy
- series redundancy
- series-parallel redundancy
- total redundancy* * *Англо-русский словарь нефтегазовой промышленности > redundancy
-
6 redundancy equipment with coincidence logic
резервное оборудование с логическими элементами совпадений; избыточное оборудование с логикой совпаденийEnglish-Russian dictionary on nuclear energy > redundancy equipment with coincidence logic
-
7 sequential-parallel redundancy
Большой англо-русский и русско-английский словарь > sequential-parallel redundancy
-
8 sequential-parallel redundancy
комбинированное резервирование; состояние нагруженного и ненагруженного резерва* * *Англо-русский словарь нефтегазовой промышленности > sequential-parallel redundancy
-
9 sequential-parallel redundancy
Универсальный англо-русский словарь > sequential-parallel redundancy
-
10 sequential-parallel redundancy
комбинированное резервирование; состояние нагруженного и ненагруженного резерваThe English-Russian dictionary on reliability and quality control > sequential-parallel redundancy
-
11 parallel-sequential [parallel-series] redundancy
комбинированное резервирование; состояние нагруженного и ненагруженного резерваThe English-Russian dictionary on reliability and quality control > parallel-sequential [parallel-series] redundancy
-
12 code
1) кода) совокупность символов или сигналов и система правил для представления информации в виде последовательности элементов такой совокупностиб) вчт программа; текст программы2) кодироватьа) представлять информацию в виде последовательности элементов некоторой совокупности символов или сигналов по определённой системе правилб) вчт программировать3) pl вчт скрытые коды (напр. в текстовых редакторах)4) бион генетический код5) модулировать (напр. в системе с дельта-модуляцией)7) кодекс•- absolute code
- access code
- adaptive code
- additional code
- address code
- air-to-ground liaison code
- A-law code
- Alfa code
- alphanumeric code
- alternate mark inversion code
- AMI code
- answerback code
- area code
- assembly code
- authentication code
- authorization code
- automatic code
- auxiliary code
- balanced code
- bank code
- bar code
- Barker code
- base station identity code
- Baudot code
- BCD code
- BCH code
- binary code
- binary-coded decimal code
- biorthogonal code
- bipolar code
- bipolar with N-zero substitution code
- biquinary code
- block code
- BNZS code
- boot code
- bootstrap code
- Bose-Chaudhuri-Hocquenghem code
- break code
- brevity code
- BT code
- burst-correcting code
- burst-detecting code
- burst-trapping code- C/A code- cable code
- cable Morse code
- call directing code
- call-station code
- capacitor color code
- card code
- carrier identification code
- chain code
- channel code
- character code
- circulant code
- close-packed code
- coarse acquisition code
- color code
- color bar code
- command code
- complementary code
- complementary Golay code
- completion code
- computer code
- computer numerical code
- concatenated code
- condensation code
- condition code
- constant-weight code
- Continental code
- control code
- convolution code
- convolutional code
- country code- cue code- cyclic code
- cyclic binary code
- decimal code
- decomposable Golay code
- dense binary code
- destination code
- device code
- diffuse code
- digital code
- direct code
- directing code
- dot-and-dash code
- double-adjacent error-correcting code
- drawing code
- DVD regional code
- EFM code
- EIA color code
- eight-level code
- eight-to-fourteen modulation code
- elaborated code
- electrical code
- electrical safety code
- entropy code
- equal-length code
- equidistant code
- equipment manufacturer code
- error code
- error-control code - escape code
- excess-three code
- executable machine code
- extended binary-coded decimal interchange-code
- extremal code
- feedback balanced code
- fieldata code
- firewall code
- five-level code
- fixed-length code
- fixed-weight code
- format code
- four-of-eight code
- four-out-of-eight code
- fractal code
- framing code
- full frame time code
- function code
- GBT code
- generalized burst-trapping code
- genetic code - group code
- Hamming code
- hidden codes - HSF code
- Huffman-Shannon-Fano code
- ID code
- identification code
- identity code
- inheritance code
- in-line code
- instruction code
- interchange code
- interlace code
- interleaved code
- International cable code
- international Morse code - interrupt code
- inverted code
- iterative code
- jargon code
- Java code
- key code
- lead color code
- legacy code
- line code
- linear code
- lock code
- longitudinal time code
- loop code
- machine code
- macro code
- magnetic tape code
- majority-decodable code
- make code
- Manchester code
- Manchester II code
- manipulation detection code
- manufacturer code
- maximally compressed pattern recognition code
- message authentication code
- Miller code
- minimum redundance code
- mnemonic code
- mobile country code
- mobile network code
- modular code
- Moore code
- Morse code
- Morse cable code
- multiple-address code
- multiple-burst code
- mutual code
- N-address code
- N-ary code
- native code
- nonprint code
- nonreturn-to-zero code
- nonreturn-to-zero inverted code
- NRZ code
- NRZI code
- object code
- offset binary code
- on-drop frame time code
- one-level code
- open source code - P-code
- p-code
- parity code
- parity-checking code
- partial-response code
- path-invariant code
- perfect code
- permutation code
- permutation-modulation code
- pilot code
- PN code
- polynomial code
- position code
- postal code
- precision code
- predictive code
- prefix code
- primary address code
- printer-telegraph code
- printing-telegraph code
- PRN code
- progressive code
- progressive/sequential code
- pseudonoise code
- pseudorandom noise code
- pseudo-ternary code
- public code
- pulse code
- punched-card code
- punched-tape code
- punctured code
- quasi-cyclic code
- quasi-perfect code
- quaternary code
- quinbinary code
- radar code
- radar-type code
- radio paging code N 1
- randomized code
- Read-Solomon code - redundancy-reducing code
- redundant code
- Reed-Muller code
- reenterable code
- reentrant code
- reflected binary code
- reflective code
- regional code
- relocatable code
- reserved code
- residue code
- resistor color code
- restricted code
- RETMA color code
- return code
- return-to-zero code
- RL code
- RMA color code
- robust code
- routing code
- run-length code
- RZ code
- salami code
- scan code
- search code
- secret code
- self-checking code
- self-complementing code
- self-correcting code
- self-documenting code
- self-dual code
- self-modifying code
- self-validating code
- sequential code
- servo code
- servo Gray code
- seven-unit teleprinter code
- SF code
- Shannon-Fano code
- shift codes
- short code
- signature code
- simplex code
- single-burst code
- SMPTE control code
- SMPTE time code
- source code
- spaghetti code
- specific code
- station-identification code
- stochastic code
- stop code
- straight-line code
- substitution error-correcting code
- synchronization error-correcting code
- systematic code
- systematic error-checking code
- tape code
- telegraph code
- teletype code
- teletypewriter code
- threaded code
- time code
- time address code
- time-invariant code
- transaction code - transparent code
- tree code
- trellis code
- twinned-binary code
- two-of-five code
- two-out-of-five code
- two-part code
- unbreakable code
- unipolar code
- unit disparity code
- unit-memory code - variable-length code
- variable-rate code
- Walsh code
- weighted code
- word code
- Wyner-Ash code
- zero-disparity code
- ZIP code
- zip code -
13 code
1) кода) совокупность символов или сигналов и система правил для представления информации в виде последовательности элементов такой совокупностиб) вчт. программа; текст программы2) кодироватьа) представлять информацию в виде последовательности элементов некоторой совокупности символов или сигналов по определённой системе правилб) вчт. программировать3) pl.; вчт. скрытые коды (напр. в текстовых редакторах)4) бион. генетический код5) модулировать (напр. в системе с дельта-модуляцией)7) кодекс•- absolute code
- access code
- adaptive code
- additional code
- address code
- air-to-ground liaison code
- A-law code
- Alfa code
- alphanumeric code
- alternate mark inversion code
- AMI code
- answerback code
- area code
- assembly code
- authentication code
- authorization code
- automatic code
- auxiliary code
- balanced code
- bank code
- bar code
- Barker code
- base station identity code
- Baudot code
- BCD code
- BCH code
- binary code
- binary-coded decimal code
- biorthogonal code
- bipolar code
- bipolar with N zero substitution code
- biquinary code
- block code
- BNZS code
- boot code
- bootstrap code
- Bose-Chaudhuri-Hocquenghem code
- break code
- brevity code
- BT code
- burst-correcting code
- burst-detecting code
- burst-trapping code
- C/A code
- cable code
- cable Morse code
- call directing code
- call-station code
- capacitor color code
- card code
- carrier identification code
- chain code
- channel code
- character code
- circulant code
- close-packed code
- coarse acquisition code
- color bar code
- color code
- command code
- complementary code
- complementary Golay code
- completion code
- computer code
- computer numerical code
- concatenated code
- condensation code
- condition code
- constant-weight code
- Continental code
- control code
- convolution code
- convolutional code
- country code
- cross-interleaved Read-Solomon code
- cue code
- cyclic binary code
- cyclic code
- decimal code
- decomposable Golay code
- dense binary code
- destination code
- device code
- diffuse code
- digital code
- direct code
- directing code
- dot-and-dash code
- double-adjacent error-correcting code
- drawing code
- DVD regional code
- EFM code
- EIA color code
- eight-level code
- eight-to-fourteen modulation code
- elaborated code
- electrical code
- electrical safety code
- entropy code
- equal-length code
- equidistant code
- equipment manufacturer code
- error code
- error detection and correction code
- error-control code
- error-correcting code
- error-detecting code
- error-locating code
- escape code
- excess-three code
- executable machine code
- extended binary-coded decimal interchange code
- extremal code
- feedback balanced code
- fieldata code
- firewall code
- five-level code
- fixed-length code
- fixed-weight code
- format code
- four-of-eight code
- four-out-of-eight code
- fractal code
- framing code
- full frame time code
- function code
- GBT code
- generalized burst-trapping code
- genetic code
- Golay sequential code
- Gray code
- group code
- Hamming code
- hidden codes
- high density bipolar code
- Hollerith code
- HSF code
- Huffman-Shannon-Fano code
- ID code
- identification code
- identity code
- inheritance code
- in-line code
- instruction code
- interchange code
- interlace code
- interleaved code
- International cable code
- international Morse code
- international standard recording code
- interrogation-code
- interrupt code
- inverted code
- iterative code
- jargon code
- Java code
- key code
- lead color code
- legacy code
- line code
- linear code
- lock code
- longitudinal time code
- loop code
- machine code
- macro code
- magnetic tape code
- majority-decodable code
- make code
- Manchester code
- Manchester II code
- manipulation detection code
- manufacturer code
- maximally compressed pattern recognition code
- message authentication code
- Miller code
- minimum redundance code
- mnemonic code
- mobile country code
- mobile network code
- modular code
- Moore code
- Morse cable code
- Morse code
- multiple-address code
- multiple-burst code
- mutual code
- N-address code
- N-ary code - nonreturn-to-zero code
- nonreturn-to-zero inverted code
- NRZ code
- NRZI code
- object code
- offset binary code
- on-drop frame time code
- one-level code
- open source code
- operation code
- order code
- P code
- parity code
- parity-checking code
- partial-response code
- path-invariant code
- p-code
- perfect code
- permutation code
- permutation-modulation code
- pilot code
- PN code
- polynomial code
- position code
- postal code
- precision code
- predictive code
- prefix code
- primary address code
- printer-telegraph code
- printing-telegraph code
- PRN code
- progressive code
- progressive/sequential code
- pseudonoise code
- pseudorandom noise code
- pseudo-ternary code
- public code
- pulse code
- punched-card code
- punched-tape code
- punctured code
- quasi-cyclic code
- quasi-perfect code
- quaternary code
- quinbinary code
- radar code
- radar-type code
- radio paging code N 1
- randomized code
- Read-Solomon code
- Read-Solomon product code
- recurrent code
- redundancy-reducing code
- redundant code
- Reed-Muller code
- reenterable code
- reentrant code
- reflected binary code
- reflective code
- regional code
- relocatable code
- reserved code
- residue code
- resistor color code
- restricted code
- RETMA color code
- return code
- return-to-zero code
- RL code
- RMA color code
- robust code
- routing code
- run-length code
- RZ code
- salami code
- scan code
- search code
- secret code
- self-checking code
- self-complementing code
- self-correcting code
- self-documenting code
- self-dual code
- self-modifying code
- self-validating code
- sequential code
- servo code
- servo Gray code
- seven-unit teleprinter code
- SF code
- Shannon-Fano code
- shift codes
- short code
- signature code
- simplex code
- single-burst code
- SMPTE control code
- SMPTE time code
- source code
- spaghetti code
- specific code
- station-identification code
- stochastic code
- stop code
- straight-line code
- substitution error-correcting code
- synchronization error-correcting code
- systematic code
- systematic error-checking code
- tape code
- telegraph code
- teletype code
- teletypewriter code
- threaded code
- time address code
- time code
- time-invariant code
- transaction code
- transfer authentication code
- transorthogonal code
- transparent code
- tree code
- trellis code
- twinned-binary code
- two-of-five code
- two-out-of-five code
- two-part code
- unbreakable code
- unipolar code
- unit disparity code
- unit-memory code
- Universal code
- universal product code
- variable-length code
- variable-rate code
- Walsh code
- weighted code
- word code
- Wyner-Ash code
- zero-disparity code
- ZIP code
- zip codeThe New English-Russian Dictionary of Radio-electronics > code
-
14 algorithm
1) алгоритм2) правило; процедура; метод•- adaptive algorithm
- Agarval-Cooley algorithm
- aim algorithm
- annealing algorithm
- asymmetric encryption algorithm
- autoregressive algorithm
- backoff algorithm
- back propagation of error algorithm
- batch algorithm
- Bellman-Ford algorithm
- best cost path algorithm
- bisection algorithm
- branch and bound algorithm - CART algorithm
- channel algorithm
- channel routing algorithm
- Cholesky algorithm
- classification and regression tree algorithm
- clustering algorithm
- Cochran-Orcutt algorithm
- compression algorithm
- conjugate directions algorithm
- conjugate gradients algorithm
- constructive algorithm
- contour following algorithm
- control algorithm
- convolution algorithm
- Cooley-Tuckey algorithm
- cryptographic algorithm
- deflation compression algorithm
- differential synthesis algorithm
- Diffie-Hellman algorithm
- digital signal processing algorithm
- digital signature algorithm
- Dijkstra algorithm
- distance vector algorithm
- DSP algorithm
- dynamic programming algorithm
- edge-tracking algorithm
- evolutionary algorithm
- exact embedding algorithm
- expansion algorithm
- fast algorithm
- fast convolution Agarval-Cooley algorithm
- fixed-weight algorithm
- Ford-Fulkerson algorithm
- fundamental algorithm
- fuzzy algorithm
- general algorithm - greedy algorithm
- Gummel's algorithm
- hashing algorithm
- heuristic algorithm
- ID3 algorithm
- identification algorithm
- initialization algorithm
- integer algorithm - iterative dichotomizer 3 algorithm
- k-means algorithm
- learning algorithm
- least frequently used algorithm
- least recently used algorithm
- Lee-Moore algorithm
- Lee algorithm
- Lee-type algorithm
- Lempel-Ziv algorithm
- Lempel-Ziv-Welch algorithm
- Levenberg-Marquardt algorithm
- LFU algorithm
- line-probe algorithm
- link state algorithm
- LU decomposition algorithm
- LZ algorithm
- LZW algorithm
- MacQueen's k-means algorithm
- McCulloch-Pitts algorithm
- memetic algorithm - min-cut algorithm - nested algorithm
- numerical algorithm
- Oja iterative algorithm
- on-line algorithm
- optimization algorithm
- ordering algorithm
- painter's algorithm
- parallel algorithm
- pattern classification algorithm
- pattern recognition algorithm
- pel-recursive estimation algorithm
- placement algorithm
- planning algorithm
- polynomial algorithm
- predictive algorithm
- preemptive algorithm
- Prim algorithm
- production rule based algorithm
- pruning algorithm
- pseudo least recently used algorithm
- quantum search algorithm
- quick-union algorithm
- quick-union algorithm with path compression
- Q-R-algorithm
- radix sorting algorithm
- randomized algorithm
- rank algorithm
- Read-Solomon cyclic redundancy compression algorithm
- recognition algorithm
- recurrent algorithm
- recursive algorithm
- resilient propagation algorithm - routing algorithm
- Rprop algorithm
- RSA algorithm
- scheduling algorithm
- search algorithm
- search network algorithm - self-organizing algorithm
- semi-numerical algorithm
- sequential algorithm - shortest path algorithm
- sieving algorithm
- simulated annealing training algorithm
- simulation algorithm
- smoothing algorithm
- software algorithm
- spanning tree algorithm
- spline algorithm
- splitting algorithm
- stack algorithm
- statistical algorithm
- stochastic algorithm
- supervised training algorithm
- symmetric encryption algorithm
- time-wheel algorithm
- training algorithm
- universal algorithm
- unsupervised training algorithm
- van der Waerden algorithm
- variational algorithm
- vector distance algorithm
- Viterbi algorithm
- VLSI algorithm
- weighted quick-union algorithm
- working algorithm -
15 algorithm
1) алгоритм2) правило; процедура; метод•- Agarval-Cooley algorithm
- aim algorithm
- algorithm of doubtful convergence
- annealing algorithm
- asymmetric encryption algorithm
- autoregressive algorithm
- back propagation of error algorithm
- backoff algorithm
- batch algorithm
- Bellman-Ford algorithm
- best cost path algorithm
- bisection algorithm
- branch and bound algorithm
- British Telecom Lempel-Ziv algorithm
- BTLZ algorithm
- CART algorithm
- channel algorithm
- channel routing algorithm
- Cholesky algorithm
- classification and regression tree algorithm
- clustering algorithm
- Cochran-Orcutt algorithm
- compression algorithm
- conjugate directions algorithm
- conjugate gradients algorithm
- constructive algorithm
- contour following algorithm
- control algorithm
- convolution algorithm
- Cooley-Tuckey algorithm
- cryptographic algorithm
- deflation compression algorithm
- differential synthesis algorithm
- Diffie-Hellman algorithm
- digital signal processing algorithm
- digital signature algorithm
- Dijkstra algorithm
- distance vector algorithm
- DSP algorithm
- dynamic programming algorithm
- edge-tracking algorithm
- evolutionary algorithm
- exact embedding algorithm
- expansion algorithm
- fast algorithm
- fast convolution Agarval-Cooley algorithm
- fixed-weight algorithm
- Ford-Fulkerson algorithm
- fundamental algorithm
- fuzzy algorithm
- general algorithm
- genetic algorithm
- graph search algorithm
- greedy algorithm
- Gummel's algorithm
- hashing algorithm
- heuristic algorithm
- ID3 algorithm
- identification algorithm
- initialization algorithm
- integer algorithm
- international data encryption algorithm
- iterative algorithm
- iterative dichotomizer 3 algorithm
- k-means algorithm
- learning algorithm
- least frequently used algorithm
- least recently used algorithm
- Lee-algorithm
- Lee-Moore algorithm
- Lee-type algorithm
- Lempel-Ziv algorithm
- Lempel-Ziv-Welch algorithm
- Levenberg-Marquardt algorithm
- LFU algorithm
- line-probe algorithm
- link state algorithm
- LU decomposition algorithm
- LZ algorithm
- LZW algorithm
- MacQueen's k-means algorithm
- McCulloch-Pitts algorithm
- memetic algorithm
- message authentication algorithm
- metaheuristic algorithm
- min-cut algorithm
- modified Gram-Schmidt algorithm
- Nelder-Mead simplex algorithm
- nested algorithm
- numerical algorithm
- Oja iterative algorithm
- on-line algorithm
- optimization algorithm
- ordering algorithm
- painter's algorithm
- parallel algorithm
- pattern classification algorithm
- pattern recognition algorithm
- pel-recursive estimation algorithm
- placement algorithm
- planning algorithm
- polynomial algorithm
- predictive algorithm
- preemptive algorithm
- Prim algorithm
- production rule based algorithm
- pruning algorithm
- pseudo least recently used algorithm
- Q-R-algorithm
- quantum search algorithm
- quick-union algorithm with path compression
- quick-union algorithm
- radix sorting algorithm
- randomized algorithm
- rank algorithm
- Read-Solomon cyclic redundancy compression algorithm
- recognition algorithm
- recurrent algorithm
- recursive algorithm
- resilient propagation algorithm
- Rivest-Shamir-Adleman algorithm
- robust algorithm
- routing algorithm
- RProp algorithm
- RSA algorithm
- scheduling algorithm
- search algorithm
- search network algorithm
- secure hash algorithm
- selective-trace algorithm
- self-organizing algorithm
- semi-numerical algorithm
- sequential algorithm
- sequential leader clustering algorithm
- serial algorithm
- shortest path algorithm
- sieving algorithm
- simulated annealing training algorithm
- simulation algorithm
- smoothing algorithm
- software algorithm
- spanning tree algorithm
- spline algorithm
- splitting algorithm
- stack algorithm
- statistical algorithm
- stochastic algorithm
- supervised training algorithm
- symmetric encryption algorithm
- time-wheel algorithm
- training algorithm
- universal algorithm
- unsupervised training algorithm
- van der Waerden algorithm
- variational algorithm
- vector distance algorithm
- Viterbi algorithm
- VLSI algorithm
- weighted quick-union algorithm
- working algorithmThe New English-Russian Dictionary of Radio-electronics > algorithm
-
16 target
объект; цель; мишень; задача; задание; норма; заданный показатель [срок]; конечный пункт; пункт назначения; заданное значение; норматив ( боевой подготовки) ; программировать траекторию ( ракеты) ; нацеливать; прицеливать; ставить задачу на удар [стрельбу] по цели; наводить; подготавливать огонь; приводить ( оружие) к нормальному бою, пристреливать; определять разнобой ( орудий) ; засекать ( цель) ;flare drop tow(ed) target — буксируемая мишень, отстреливающая ИК ловушки
pass the target (to) — передавать цель (напр. в другой сектор)
— aerial training target— hardened target— heat contrast target— interdiction-type target— pay off target— personnel-type target— prone silhouette target— scheduled nuclear target— shore-based target— towed target -
17 Language
Philosophy is written in that great book, the universe, which is always open, right before our eyes. But one cannot understand this book without first learning to understand the language and to know the characters in which it is written. It is written in the language of mathematics, and the characters are triangles, circles, and other figures. Without these, one cannot understand a single word of it, and just wanders in a dark labyrinth. (Galileo, 1990, p. 232)It never happens that it [a nonhuman animal] arranges its speech in various ways in order to reply appropriately to everything that may be said in its presence, as even the lowest type of man can do. (Descartes, 1970a, p. 116)It is a very remarkable fact that there are none so depraved and stupid, without even excepting idiots, that they cannot arrange different words together, forming of them a statement by which they make known their thoughts; while, on the other hand, there is no other animal, however perfect and fortunately circumstanced it may be, which can do the same. (Descartes, 1967, p. 116)Human beings do not live in the object world alone, nor alone in the world of social activity as ordinarily understood, but are very much at the mercy of the particular language which has become the medium of expression for their society. It is quite an illusion to imagine that one adjusts to reality essentially without the use of language and that language is merely an incidental means of solving specific problems of communication or reflection. The fact of the matter is that the "real world" is to a large extent unconsciously built on the language habits of the group.... We see and hear and otherwise experience very largely as we do because the language habits of our community predispose certain choices of interpretation. (Sapir, 1921, p. 75)It powerfully conditions all our thinking about social problems and processes.... No two languages are ever sufficiently similar to be considered as representing the same social reality. The worlds in which different societies live are distinct worlds, not merely the same worlds with different labels attached. (Sapir, 1985, p. 162)[A list of language games, not meant to be exhaustive:]Giving orders, and obeying them- Describing the appearance of an object, or giving its measurements- Constructing an object from a description (a drawing)Reporting an eventSpeculating about an eventForming and testing a hypothesisPresenting the results of an experiment in tables and diagramsMaking up a story; and reading itPlay actingSinging catchesGuessing riddlesMaking a joke; and telling itSolving a problem in practical arithmeticTranslating from one language into anotherLANGUAGE Asking, thanking, cursing, greeting, and praying-. (Wittgenstein, 1953, Pt. I, No. 23, pp. 11 e-12 e)We dissect nature along lines laid down by our native languages.... The world is presented in a kaleidoscopic flux of impressions which has to be organized by our minds-and this means largely by the linguistic systems in our minds.... No individual is free to describe nature with absolute impartiality but is constrained to certain modes of interpretation even while he thinks himself most free. (Whorf, 1956, pp. 153, 213-214)We dissect nature along the lines laid down by our native languages.The categories and types that we isolate from the world of phenomena we do not find there because they stare every observer in the face; on the contrary, the world is presented in a kaleidoscopic flux of impressions which has to be organized by our minds-and this means largely by the linguistic systems in our minds.... We are thus introduced to a new principle of relativity, which holds that all observers are not led by the same physical evidence to the same picture of the universe, unless their linguistic backgrounds are similar or can in some way be calibrated. (Whorf, 1956, pp. 213-214)9) The Forms of a Person's Thoughts Are Controlled by Unperceived Patterns of His Own LanguageThe forms of a person's thoughts are controlled by inexorable laws of pattern of which he is unconscious. These patterns are the unperceived intricate systematizations of his own language-shown readily enough by a candid comparison and contrast with other languages, especially those of a different linguistic family. (Whorf, 1956, p. 252)It has come to be commonly held that many utterances which look like statements are either not intended at all, or only intended in part, to record or impart straightforward information about the facts.... Many traditional philosophical perplexities have arisen through a mistake-the mistake of taking as straightforward statements of fact utterances which are either (in interesting non-grammatical ways) nonsensical or else intended as something quite different. (Austin, 1962, pp. 2-3)In general, one might define a complex of semantic components connected by logical constants as a concept. The dictionary of a language is then a system of concepts in which a phonological form and certain syntactic and morphological characteristics are assigned to each concept. This system of concepts is structured by several types of relations. It is supplemented, furthermore, by redundancy or implicational rules..., representing general properties of the whole system of concepts.... At least a relevant part of these general rules is not bound to particular languages, but represents presumably universal structures of natural languages. They are not learned, but are rather a part of the human ability to acquire an arbitrary natural language. (Bierwisch, 1970, pp. 171-172)In studying the evolution of mind, we cannot guess to what extent there are physically possible alternatives to, say, transformational generative grammar, for an organism meeting certain other physical conditions characteristic of humans. Conceivably, there are none-or very few-in which case talk about evolution of the language capacity is beside the point. (Chomsky, 1972, p. 98)[It is] truth value rather than syntactic well-formedness that chiefly governs explicit verbal reinforcement by parents-which renders mildly paradoxical the fact that the usual product of such a training schedule is an adult whose speech is highly grammatical but not notably truthful. (R. O. Brown, 1973, p. 330)he conceptual base is responsible for formally representing the concepts underlying an utterance.... A given word in a language may or may not have one or more concepts underlying it.... On the sentential level, the utterances of a given language are encoded within a syntactic structure of that language. The basic construction of the sentential level is the sentence.The next highest level... is the conceptual level. We call the basic construction of this level the conceptualization. A conceptualization consists of concepts and certain relations among those concepts. We can consider that both levels exist at the same point in time and that for any unit on one level, some corresponding realizate exists on the other level. This realizate may be null or extremely complex.... Conceptualizations may relate to other conceptualizations by nesting or other specified relationships. (Schank, 1973, pp. 191-192)The mathematics of multi-dimensional interactive spaces and lattices, the projection of "computer behavior" on to possible models of cerebral functions, the theoretical and mechanical investigation of artificial intelligence, are producing a stream of sophisticated, often suggestive ideas.But it is, I believe, fair to say that nothing put forward until now in either theoretic design or mechanical mimicry comes even remotely in reach of the most rudimentary linguistic realities. (Steiner, 1975, p. 284)The step from the simple tool to the master tool, a tool to make tools (what we would now call a machine tool), seems to me indeed to parallel the final step to human language, which I call reconstitution. It expresses in a practical and social context the same understanding of hierarchy, and shows the same analysis by function as a basis for synthesis. (Bronowski, 1977, pp. 127-128)t is the language donn eґ in which we conduct our lives.... We have no other. And the danger is that formal linguistic models, in their loosely argued analogy with the axiomatic structure of the mathematical sciences, may block perception.... It is quite conceivable that, in language, continuous induction from simple, elemental units to more complex, realistic forms is not justified. The extent and formal "undecidability" of context-and every linguistic particle above the level of the phoneme is context-bound-may make it impossible, except in the most abstract, meta-linguistic sense, to pass from "pro-verbs," "kernals," or "deep deep structures" to actual speech. (Steiner, 1975, pp. 111-113)A higher-level formal language is an abstract machine. (Weizenbaum, 1976, p. 113)Jakobson sees metaphor and metonymy as the characteristic modes of binarily opposed polarities which between them underpin the two-fold process of selection and combination by which linguistic signs are formed.... Thus messages are constructed, as Saussure said, by a combination of a "horizontal" movement, which combines words together, and a "vertical" movement, which selects the particular words from the available inventory or "inner storehouse" of the language. The combinative (or syntagmatic) process manifests itself in contiguity (one word being placed next to another) and its mode is metonymic. The selective (or associative) process manifests itself in similarity (one word or concept being "like" another) and its mode is metaphoric. The "opposition" of metaphor and metonymy therefore may be said to represent in effect the essence of the total opposition between the synchronic mode of language (its immediate, coexistent, "vertical" relationships) and its diachronic mode (its sequential, successive, lineal progressive relationships). (Hawkes, 1977, pp. 77-78)It is striking that the layered structure that man has given to language constantly reappears in his analyses of nature. (Bronowski, 1977, p. 121)First, [an ideal intertheoretic reduction] provides us with a set of rules"correspondence rules" or "bridge laws," as the standard vernacular has it-which effect a mapping of the terms of the old theory (T o) onto a subset of the expressions of the new or reducing theory (T n). These rules guide the application of those selected expressions of T n in the following way: we are free to make singular applications of their correspondencerule doppelgangers in T o....Second, and equally important, a successful reduction ideally has the outcome that, under the term mapping effected by the correspondence rules, the central principles of T o (those of semantic and systematic importance) are mapped onto general sentences of T n that are theorems of Tn. (P. Churchland, 1979, p. 81)If non-linguistic factors must be included in grammar: beliefs, attitudes, etc. [this would] amount to a rejection of the initial idealization of language as an object of study. A priori such a move cannot be ruled out, but it must be empirically motivated. If it proves to be correct, I would conclude that language is a chaos that is not worth studying.... Note that the question is not whether beliefs or attitudes, and so on, play a role in linguistic behavior and linguistic judgments... [but rather] whether distinct cognitive structures can be identified, which interact in the real use of language and linguistic judgments, the grammatical system being one of these. (Chomsky, 1979, pp. 140, 152-153)23) Language Is Inevitably Influenced by Specific Contexts of Human InteractionLanguage cannot be studied in isolation from the investigation of "rationality." It cannot afford to neglect our everyday assumptions concerning the total behavior of a reasonable person.... An integrational linguistics must recognize that human beings inhabit a communicational space which is not neatly compartmentalized into language and nonlanguage.... It renounces in advance the possibility of setting up systems of forms and meanings which will "account for" a central core of linguistic behavior irrespective of the situation and communicational purposes involved. (Harris, 1981, p. 165)By innate [linguistic knowledge], Chomsky simply means "genetically programmed." He does not literally think that children are born with language in their heads ready to be spoken. He merely claims that a "blueprint is there, which is brought into use when the child reaches a certain point in her general development. With the help of this blueprint, she analyzes the language she hears around her more readily than she would if she were totally unprepared for the strange gabbling sounds which emerge from human mouths. (Aitchison, 1987, p. 31)Looking at ourselves from the computer viewpoint, we cannot avoid seeing that natural language is our most important "programming language." This means that a vast portion of our knowledge and activity is, for us, best communicated and understood in our natural language.... One could say that natural language was our first great original artifact and, since, as we increasingly realize, languages are machines, so natural language, with our brains to run it, was our primal invention of the universal computer. One could say this except for the sneaking suspicion that language isn't something we invented but something we became, not something we constructed but something in which we created, and recreated, ourselves. (Leiber, 1991, p. 8)Historical dictionary of quotations in cognitive science > Language
См. также в других словарях:
Minimum redundancy feature selection — is an algorithm frequently used in a method to accurately identify characteristics of genes and phenotypes and narrow down their relevance and is usually described in its pairing with relevant feature selection as Minimum Redundancy Maximum… … Wikipedia
Database — A database is an organized collection of data for one or more purposes, usually in digital form. The data are typically organized to model relevant aspects of reality (for example, the availability of rooms in hotels), in a way that supports… … Wikipedia
RAID — This article is about the data storage technology. For other uses, see Raid (disambiguation). RAID, an acronym for Redundant Array of Independent Disks (originally Redundant Array of Inexpensive Disks),[1] is a storage… … Wikipedia
JPEG — For other uses, see JPEG (disambiguation). Joint Photographic Experts Group A photo of a cat compressed with successively more lossy compression ratios from right to left Filename extension .jpg … Wikipedia
Hard disk drive — Hard drive redirects here. For other uses, see Hard drive (disambiguation). Hard disk drive Mechanical interior of a modern hard disk drive Date invented 24 December 1954 [1] … Wikipedia
MPEG-1 — Moving Picture Experts Group Phase 1 (MPEG 1) Filename extension .mpg, .mpeg, .mp1, .mp2, .mp3, .m1v, .m1a, .m2a, .mpa, .mpv Internet media type audio/mpeg, video/mpeg Developed by ISO, IEC Type of format audio, vid … Wikipedia
Abkürzungen/Computer — Dies ist eine Liste technischer Abkürzungen, die im IT Bereich verwendet werden. A [nach oben] AA Antialiasing AAA authentication, authorization and accounting, siehe Triple A System AAC Advanced Audio Coding AACS … Deutsch Wikipedia
Liste der Abkürzungen (Computer) — Dies ist eine Liste technischer Abkürzungen, die im IT Bereich verwendet werden. A [nach oben] AA Antialiasing AAA authentication, authorization and accounting, siehe Triple A System AAC Advanced Audio Coding AACS … Deutsch Wikipedia
Standard RAID levels — The standard RAID levels are a basic set of RAID configurations and employ striping, mirroring, or parity.The standard RAID levels can be nested for other benefits ( see Nested RAID levels ). Concatenation (SPAN) The controller treats each drive… … Wikipedia
Non-standard RAID levels — Main article: RAID Although all RAID implementations differ from the specification to some extent, some companies have developed non standard RAID implementations that differ substantially from the standard. Non RAID drive architectures… … Wikipedia
Delta encoding — Not to be confused with Elias delta coding. Delta encoding is a way of storing or transmitting data in the form of differences between sequential data rather than complete files; more generally this is known as data differencing. Delta encoding… … Wikipedia
